/* https://leetcode-cn.com/problems/two-sum/ */


public class _1_两数之和 {
    public int[] twoSum(int[] nums, int target) {
        int [] result = new int[2];
        for (int i = 0;i< nums.length;i++){
            // j = i + 1避免元素重复
            for (int j = i + 1;j < nums.length;j++){
                if (nums[i] + nums[j] == target){
                    result[0] = i;
                    result[1] = j;
                }
            }
        }
        return result;
    }
}
